Traffic interference cancellation

ABSTRACT

A method and system for interference cancellation (IC). One aspect relates to traffic interference cancellation. Another aspect relates to joint IC for pilot, overhead and data. Another aspect relates to improved channel estimation. Another aspect relates to adaptation of transmit subchannel gains.

CLAIM OF PRIORITY UNDER 35 U.S.C. §119

The present application claims priority to co-assigned U.S. ProvisionalApplication No. 60/638,666, entitled “TRAFFIC INTERFERENCE CANCELLATIONAT THE BTS ON A CDMA REVERSE LINK,” filed on Dec. 23, 2004, which isincorporated by reference.

BACKGROUND

1. Field

The present invention relates to wireless communication systemsgenerally, and specifically to traffic interference cancellation inwireless communication systems.

2. Background

A communication system may provide communication between base stationsand access terminals. Forward link or downlink refers to transmissionfrom a base station to an access terminal. Reverse link or uplink refersto transmission from an access terminal to a base station. Each accessterminal may communicate with one or more base stations on the forwardand reverse links at a given moment, depending on whether the accessterminal is active and whether the access terminal is in soft handoff.

BRIEF DESCRIPTION OF DRAWINGS

The features, nature, and advantages of the present application may bemore apparent from the detailed description set forth below with thedrawings. Like reference numerals and characters may identify the sameor similar objects.

FIG. 1 illustrates a wireless communication system with base stationsand access terminals.

FIG. 2 illustrates an example of transmitter structure and/or process,which may be implemented at an access terminal of FIG. 1.

FIG. 3 illustrates an example of a receiver process and/or structure,which may be implemented at a base station of FIG. 1.

FIG. 4 illustrates another embodiment of a base station receiver processor structure.

FIG. 5 illustrates a general example of power distribution of threeusers in the system of FIG. 1.

FIG. 6 shows an example of a uniform time-offset distribution for frameasynchronous traffic interference cancellation for users with equaltransmit power.

FIG. 7 illustrates an interlacing structure used for the reverse linkdata packets and a forward link automatic repeat request channel.

FIG. 8 illustrates a memory that spans a complete 16-slot packet.

FIG. 9A illustrates a method of traffic interference cancellation for anexample of sequential interference cancellation (SIC) with no delayeddecoding.

FIG. 9B illustrates an apparatus to perform the method of FIG. 9A.

FIG. 10 illustrates a receiver sample buffer after arrival of successivesubpackets of an interlace with interference cancellation of decodedsubpackets.

FIG. 11 illustrates an overhead channels structure.

FIG. 12A illustrates a method to first perform pilot IC (PIC) and thenperform overhead IC (OIC) and traffic IC (TIC) together.

FIG. 12B illustrates an apparatus to perform the method of FIG. 12A.

FIG. 13A illustrates a variation of the method in FIG. 12A.

FIG. 13B illustrates an apparatus to perform the method of FIG. 13A.

FIG. 14A illustrates a method to perform joint PIC, OIC and TIC.

FIG. 14B illustrates an apparatus to perform the method of FIG. 14A.

FIG. 15A illustrates a variation of the method in FIG. 14A.

FIG. 15B illustrates an apparatus to perform the method of FIG. 15A.

FIG. 16 illustrates a model of transmission system.

FIG. 17 illustrates an example response of combined transmit and receivefiltering.

FIGS. 18A and 18B show an example of channel estimation (real andimaginary components) based on the estimated multipath channel at eachof three RAKE fingers.

FIGS. 19A-19B show examples of an improved channel estimate based onRAKE fingers and despreading with the data chips.

FIG. 20A illustrates a method for despreading at RAKE finger delays withregenerated data chips.

FIG. 20B illustrates an apparatus to perform the method of FIG. 20A.

FIGS. 21A and 21B show an example of estimating the composite channelusing uniformly spaced samples at chip×2 resolution.

FIG. 22A illustrates a method for estimating composite channel atuniform resolution using regenerated data chips.

FIG. 22B illustrates an apparatus to perform the method of FIG. 22A.

FIG. 23 illustrates a closed loop power control and gain control withfixed overhead subchannel gain.

FIG. 24 is a variation of FIG. 23 power control and gain control withfixed overhead subchannel gain.

FIG. 25 illustrates an example of power control with fixed overheadsubchannel gain.

FIG. 26 is similar to FIG. 24 except with overhead gain control.

FIG. 27 illustrates a variation of FIG. 26 with DRC-only overhead gaincontrol.

DETAILED DESCRIPTION

Any embodiment described herein is not necessarily preferable oradvantageous over other embodiments. While various aspects of thepresent disclosure are presented in drawings, the drawings are notnecessarily drawn to scale or drawn to be all-inclusive.

FIG. 1 illustrates a wireless communication system 100, which includes asystem controller 102, base stations 104 a-104 b, and a plurality ofaccess terminals 106 a-106 h. The system 100 may have any number ofcontrollers 102, base stations 104 and access terminals 106. Variousaspects and embodiments of the present disclosure described below may beimplemented in the system 100.

Access terminals 106 may be mobile or stationary and may be dispersedthroughout the communication system 100 of FIG. 1. An access terminal106 may be connected to or implemented in a computing device, such as alaptop personal computer. Alternatively, an access terminal may be aself-contained data device, such as a personal digital assistant (PDA).An access terminal 106 may refer to various types of devices, such as awired phone, a wireless phone, a cellular phone, a lap top computer, awireless communication personal computer (PC) card, a PDA, an externalor internal modem, etc. An access terminal may be any device thatprovides data connectivity to a user by communicating through a wirelesschannel or through a wired channel, for example using fiber optic orcoaxial cables. An access terminal may have various names, such asmobile station, access unit, subscriber unit, mobile device, mobileterminal, mobile unit, mobile phone, mobile, remote station, remoteterminal, remote unit, user device, user equipment, handheld device,etc.

The system 100 provides communication for a number of cells, where eachcell is serviced by one or more base stations 104. A base station 104may also be referred to as a base station transceiver system (BTS), anaccess point, a part of an access network, a modem pool transceiver(MPT), or a Node B. Access network refers to network equipment providingdata connectivity between a packet switched data network (e.g., theInternet) and the access terminals 106.

Forward link (FL) or downlink refers to transmission from a base station104 to an access terminal 106. Reverse link (RL) or uplink refers totransmission from an access terminal 106 to a base station 104.

A base station 104 may transmit data to an access terminal 106 using adata rate selected from a set of different data rates. An accessterminal 106 may measure a signal-to-noise-and-interference ratio (SINR)of a pilot signal sent by the base station 104 and determine a desireddata rate for the base station 104 to transmit data to the accessterminal 106. The access terminal 106 may send data request channel orData rate control (DRC) messages to the base station 104 to inform thebase station 104 of the desired data rate.

The system controller 102 (also referred to as a base station controller(BSC)) may provide coordination and control for base stations 104, andmay further control routing of calls to access terminals 106 via thebase stations 104. The system controller 102 may be further coupled to apublic switched telephone network (PSTN) via a mobile switching center(MSC), and to a packet data network via a packet data serving node(PDSN).

The communication system 100 may use one or more communicationtechniques, such as code division multiple access (CDMA), IS-95, HighRate Packet Data (HRPD), also referred to as High Data Rate (HDR), asspecified in “cdma2000 High Rate Packet Data Air InterfaceSpecification,” TIA/EIA/IS-856, CDMA 1x Evolution Data Optimized(EV-DO), 1xEV-DV, Wideband CDMA (WCDMA), Universal MobileTelecommunications System (UMTS), Time Division Synchronous CDMA(TD-SCDMA), Orthogonal Frequency Division Multiplexing (OFDM), etc. Theexamples described below provide details for clarity of understanding.The ideas presented herein are applicable to other systems as well, andthe present examples are not meant to limit the present application.

FIG. 2 illustrates an example of transmitter structure and/or process,which may be implemented at an access terminal 106 of FIG. 1. Thefunctions and components shown in FIG. 2 may be implemented by software,hardware, or a combination of software and hardware. Other functions maybe added to FIG. 2 in addition to or instead of the functions shown inFIG. 2.

A data source 200 provides data to an encoder 202, which encodes databits using one or more coding schemes to provide coded data chips. Eachcoding scheme may include one or more types of coding, such as cyclicredundancy check (CRC), convolutional coding, Turbo coding, blockcoding, other types of coding, or no coding at all. Other coding schemesmay include automatic repeat request (ARQ), hybrid ARQ (H-ARQ), andincremental redundancy repeat techniques. Different types of data may becoded with different coding schemes. An interleaver 204 interleaves thecoded data bits to combat fading.

A modulator 206 modulates coded, interleaved data to generate modulateddata. Examples of modulation techniques include binary phase shiftkeying (BPSK) and quadrature phase shift keying (QPSK). The modulator206 may also repeat a sequence of modulated data or a symbol punctureunit may puncture bits of a symbol. The modulator 206 may also spreadthe modulated data with a Walsh cover (i.e., Walsh code) to form datachips. The modulator 206 may also time-division multiplex the data chipswith pilot chips and MAC chips to form a stream of chips. The modulator206 may also use a pseudo random noise (PN) spreader to spread thestream of chips with one or more PN codes (e.g., short code, long code).

A baseband-to-radio-frequency (RF) conversion unit 208 may convertbaseband signals to RF signals for transmission via an antenna 210 overa wireless communication link to one or more base stations 104.

FIG. 3 illustrates an example of a receiver process and/or structure,which may be implemented at a base station 104 of FIG. 1. The functionsand components shown in FIG. 3 may be implemented by software, hardware,or a combination of software and hardware. Other functions may be addedto FIG. 3 in addition to or instead of the functions shown in FIG. 3.

One or more antennas 300 receive the reverse link modulated signals fromone or more access terminals 106. Multiple antennas may provide spatialdiversity against deleterious path effects such as fading. Each receivedsignal is provided to a respective receiver or RF-to-baseband conversionunit 302, which conditions (e.g., filters, amplifies, downconverts) anddigitizes the received signal to generate data samples for that receivedsignal.

A demodulator 304 may demodulate the received signals to providerecovered symbols. For CDMA2000, demodulation tries to recover a datatransmission by (1) channelizing the despread samples to isolate orchannelize the received data and pilot onto their respective codechannels, and (2) coherently demodulating the channelized data with arecovered pilot to provide demodulated data. Demodulator 304 may includea received sample buffer 312 (also called joint front-end RAM (FERAM) orsample RAM) to store samples of received signals for all users/accessterminals, a rake receiver 314 to despread and process multiple signalinstances, and a demodulated symbol buffer 316 (also called back-end RAM(BERAM) or demodulated symbol RAM). There may be a plurality demodulatedsymbol buffers 316 to correspond to the plurality of users/accessterminals.

A deinterleaver 306 deinterleaves data from the demodulator 304.

A decoder 308 may decode the demodulated data to recover decoded databits transmitted by the access terminal 106. The decoded data may beprovided to a data sink 310.

FIG. 4 illustrates another embodiment of a base station receiver processor structure. In FIG. 4, data bits of successfully decoded user areinput to an interference reconstruction unit 400, which includes anencoder 402, interleaver 404, modulator 406 and filter 408. The encoder402, interleaver 404, and modulator 406 may be similar to the encoder202, interleaver 204, and modulator 206 of FIG. 2. The filter 408 formsthe decoded user's samples at FERAM resolution, e.g., change from chiprate to 2× chip rate. The decoder user's contribution to the FERAM isthem removed or canceled from the FERAM 312.

Although interference cancellation at a base station 104 is describedbelow, the concepts herein may be applied to an access terminal 106 orany other component of a communication system.

Traffic Interference Cancellation

The capacity of a CDMA reverse link may be limited by the interferencebetween users since the signals transmitted by different users are notorthogonal at the BTS 104. Therefore, techniques that decrease theinterference between users will improve the system performance of a CDMAreverse link. Techniques are described herein for the efficientimplementation of interference cancellation for advanced CDMA systemssuch as CDMA2000 1xEV-DO RevA.

Each DO RevA user transmits traffic, pilot, and overhead signals, all ofwhich may cause interference to other users. As FIG. 4 shows, signalsmay be reconstructed and subtracted from the front-end RAM 312 at theBTS 104. The transmitted pilot signal is known at the BTS 104 and may bereconstructed based on knowledge about the channel. However, theoverhead signals (such as reverse rate indicator (RRI), data requestchannel or data rate control (DRC), data source channel (DSC),acknowledgement (ACK)) are first demodulated and detected, and thetransmitted data signals are demodulated, de-interleaved, and decoded atthe BTS 104 in order to determine the transmitted overhead and trafficchips. Based on determining the transmitted chips for a given signal,the reconstruction unit 400 may then reconstruct the contribution to theFERAM 312 based on channel knowledge.

Bits of a data packet from the data source 200 may be repeated andprocessed by the encoder 202, interleaver 204 and/or modulator 206 intoa plurality of corresponding “subpackets” for transmitting to the basestation 104. If the base station 104 receives a highsignal-to-noise-ratio signal, the first subpacket may contain sufficientinformation for the base station 104 to decode and derive the originaldata packet. For example, a data packet from the data source 200 may berepeated and processed into four subpackets. The user terminal 106 sendsa first subpacket to the base station 104. The base station 104 may havea relatively low probability of correctly decoding and deriving theoriginal data packet from the first received subpacket. But as the basestation 104 receives the second, third and fourth subpackets andcombines information derived from each received subpacket, theprobability of decoding and deriving the original data packet increases.As soon as the base station 104 correctly decodes the original packet(e.g., using a cyclic redundancy check (CRC) or other error detectiontechniques), the base station 104 sends an acknowledgement signal to theuser terminal 106 to stop sending subpackets. The user terminal 106 maythen send a first subpacket of a new packet.

The reverse link of DO-RevA employs H-ARQ (FIG. 7), where each 16-slotpacket is broken into 4 subpackets and transmitted in an interlacedstructure with 8 slots between subpackets of the same interlace.Furthermore, different users/access terminals 106 may begin theirtransmissions on different slot boundaries, and therefore the 4-slotsubpackets of different users arrive at the BTS asynchronously. Theeffects of asynchronism and an efficient design of interferencecancellation receivers for H-ARQ and CDMA are described below.

The gains from interference cancellation depend on the order in whichsignals are removed from the FERAM 312. Techniques are disclosed hereinrelated to decoding (and subtracting if CRC passes) users based ontraffic-to-pilot (T2P) ratios, effective SINR, or probability ofdecoding. Various approaches are disclosed herein for re-attempting thedemodulation and decoding of users after others have been removed fromthe FERAM 312. Interference cancellation from the BTS FERAM 312 may beefficiently implemented to account for asynchronous CDMA systems, suchas EV-DO RevA, where users transmit pilot signals, control signals, andtraffic signals using Hybrid-ARQ. This disclosure may also apply toEV-DV Rel D, W-CDMA EUL, and cdma2000.

Traffic interference cancellation (TIC) may be defined as subtractiveinterference cancellation which removes the contribution of a user'sdata to the FERAM 312 after that user has decoded correctly (FIG. 4).Some of the practical problems associated with TIC on actual CDMAsystems such as CDMA2000, EV-DO, EV-DV, and WCDMA are addressed herein.Many of these problems are caused by the fact that real systems haveuser asynchrony and Hybrid ARQ. For example, CDMA2000 intentionallyspreads user data frames uniformly in time to prevent excess delay inthe backhaul network. RevA of EV-DO, Rel D of EV-DV, and EUL of WCDMAalso use Hybrid ARQ which introduces more than one possible data length.

Multi-user detection is the main category of algorithms under which TICfalls, and refers to any algorithm which attempts to improve performanceby allowing the detection of two different users to interact. A TICmethod may involve a hybrid of successive interference cancellation(also called sequential interference cancellation or SIC) and parallelinterference cancellation. “Successive interference cancellation” refersto any algorithm which decodes users sequentially and uses the data ofpreviously decoded users to improve performance. “Parallel interferencecancellation” refers broadly to decoding users at the same time andsubtracting all decoded users at the same time.

TIC may be different than pilot interference cancellation (PIC). Onedifference between TIC and PIC is that the transmitted pilot signal isknown perfectly by the receiver in advance. Therefore, PIC may subtractthe pilot contribution to the received signal using only channelestimates. A second major difference is that the transmitter and thereceiver interact closely on the traffic channel through the H-ARQmechanism. The receiver does not know the transmitted data sequenceuntil a user is successfully decoded.

Similarly, it is desirable to remove overhead channels from thefront-end RAM, in a technique called overhead interference cancellation(OIC). Overhead channels cannot be removed until the BTS 104 knows thetransmitted overhead data, and this is determined by decoding and thenreforming the overhead messages.

Successive interference cancellation defines a class of methods. Thechain rule of mutual information shows that, under ideal conditions,successive interference cancellation may achieve the capacity of amultiple access channel. The main conditions for this are that all usersare frame synchronous and each user's channel may be estimated withnegligible error.

FIG. 5 illustrates a general example of power distribution of threeusers (user 1, user 2, user 3), where the users transmit framessynchronously (frames from all users are received at the same time), andeach user is transmitting at the same data rate. Each user is instructedto use a particular transmit power, e.g., user 3 transmits at a powersubstantially equal to noise; user 2 transmits at a power substantiallyequal to user 3's power plus noise; and user 1 transmits at a powersubstantially equal to user 2 plus user 3 plus noise.

The receiver process signals from the users in decreasing order bytransmit power. Starting with k=1 (user 1 with highest power), thereceiver attempts to decode for user 1. If decoding is successful, thenuser 1's contribution to the received signal is formed and subtractedbased on his channel estimate. This may be called frame synchronoussequential interference cancellation. The receiver continues untildecoding has been attempted for all users. Each user has the same SINRafter interference cancellation of the previously decoded users'successive interference cancellation.

Unfortunately, this approach may be very sensitive to decoding errors.If a single large power user, such as user 1, does not decode correctly,the signal-to-interference-plus-noise ratio (SINR) of all followingusers may be severely degraded. This may prevent all users after thatpoint from decoding. Another drawback of this approach is that itrequires users to have particular relative powers at the receiver, whichis difficult to ensure in fading channels.

Frame Asynchronism and Interference Cancellation, e.g. cdma2000

Suppose that user frame offsets are intentionally staggered with respectto each other. This frame asynchronous operation has a number ofbenefits to the system as a whole. For example, processing power andnetwork bandwidth at the receiver would then have a more uniform usageprofile in time. In contrast, frame synchronism among users requires aburst of processing power and network resources at the end of each frameboundary since all users would finish a packet at the same time. Withframe asynchronism, the BTS 104 may decode the user with the earliestarrival time first rather than the user with the largest power.

FIG. 6 shows an example of a uniform time-offset distribution for frameasynchronous TIC for users with equal transmit power. FIG. 6 depicts asnapshot of a time instant right before frame 1 of user 1 is to bedecoded. Since frame 0 has already been decoded and canceled for allusers, its contribution to the interference is shown crosshatched (users2 and 3). In general, this approach reduces the interference by a factorof 2. Half of the interference has been removed by TIC before decodingFrame 1 of User 1.

In another embodiment, the users in FIG. 6 may refer to groups of users,e.g., user group 1, user group 2, user group 3.

A benefit of asynchronism and interference cancellation is the relativesymmetry between users in terms of power levels and error statistics ifthey want similar data rates. In general sequential interferencecancellation with equal user data rates, the last user is received withvery low power and is also quite dependent of the successful decoding ofall prior users.

Asynchronism, Hybrid ARO and Interlacing, e.g. EV-DO RevA

FIG. 7 illustrates an interlacing structure (e.g., in 1xEV-DO RevA) usedfor RL data packets and a FL ARQ channel. Each interlace (interlace 1,interlace 2, interlace 3) comprises a set of time-staggered segments. Inthis example, each segment is four time slots long. During each segment,a user terminal may transmit a subpacket to the base station. There arethree interlaces, and each segment is four time slots long. Thus, thereare eight time slots between the end of a subpacket of a given interlaceand the beginning of the next subpacket of the same interlace. Thisgives enough time for the receiver to decode the subpacket and relay anACK or negative acknowledgement (NAK) to the transmitter.

Hybrid ARQ takes advantage of the time-varying nature of fadingchannels. If the channel conditions are good for the first 1, 2 or 3subpackets, then the data frame may be decoded using only thosesubpackets, and the receiver sends an ACK to the transmitter. The ACKinstructs the transmitter not to send the remaining subpacket(s), butrather to start a new packet if desired.

Receiver Architectures for Interference Cancellation

With TIC, the data of decoded users is reconstructed and subtracted(FIG. 4) so the BTS 104 may remove the interference the data of decodedusers causes to other users. A TIC receiver may be equipped with twocircular memories: the FERAM 312 and the BERAM 316.

The FERAM 312 stores received samples (e.g., at 2× chip rate) and iscommon to all users. A non-TIC receiver would only use a FERAM of about1-2 slots (to accommodate delays in the demodulation process) since nosubtraction of traffic or overhead interference takes place. In a TICreceiver for a system with H-ARQ, the FERAM may span many slots, e.g.,40 slots, and is updated by TIC through the subtraction of interferenceof decoded users. In another configuration, the FERAM 312 may have alength that spans less than a full packet, such as a length that spans atime period from a beginning of a subpacket of a packet to an end of asubsequent subpacket of the packet.

The BERAM 316 stores demodulated symbols of the received bits asgenerated by the demodulator's rake receiver 314. Each user may have adifferent BERAM, since the demodulated symbols are obtained bydespreading with the user-specific PN sequence, and combining acrossRAKE fingers. Both a TIC and non-TIC receiver may use a BERAM 316. TheBERAM 316 in TIC is used to store demodulated symbols of previoussubpackets that are no longer stored in a FERAM 312 when the FERAM 312does not span all subpackets. The BERAM 316 may be updated eitherwhenever an attempt to decode takes place or whenever a slot exists fromthe FERAM 312.

Methods for Choosing the FERAM Length

The size of the BERAM 316 and FERAM 312 may be chosen according tovarious trade-offs between required processing power, transfer bandwidthfrom the memories to the processors, delays and performance of thesystem. In general, by using a shorter FERAM 312 the benefits of TICwill be limited, since the oldest subpacket will not be updated. On theother hand, a shorter FERAM 312 yields a reduced number ofdemodulations, subtractions and a lower transfer bandwidth.

With the RevA interlacing, a 16-slot packet (four subpackets, eachsubpacket transmitted in 4 slots) would span 40 slots. Therefore, a40-slot FERAM may be used to ensure removal of a user from all affectedslots.

FIG. 8 illustrates a 40-slot FERAM 312 that spans a complete 16-slotpacket for EV-DO RevA. Whenever a new subpacket is received, decoding isattempted for that packet using all the available subpackets stored inthe FERAM 312. If decoding is successful, then the contribution of thatpacket is canceled from the FERAM 312 by reconstructing and subtractingthe contribution of all component subpackets (1, 2, 3, or 4). ForDO-RevA FERAM lengths of 4, 16, 28, or 40 slots would span 1, 2, 3, or 4subpackets, respectively. The length of the FERAM implemented at thereceiver may depend on complexity considerations, the need to supportvarious user arrival times, and the capability of re-doing thedemodulation and decoding of users on previous frame offsets.

FIG. 9A illustrates a general method of TIC for an example of sequentialinterference cancellation (SIC) with no delayed decoding. Otherenhancements will be described below. The process starts at a startblock 900 and proceeds to a choose delay block 902. In SIC, the choosedelay block 902 may be omitted. In block 903, the BTS 104 chooses oneuser (or a group of users) among those users that terminate a subpacketin the current slot.

In block 904, demodulator 304 demodulates samples of the chosen user'ssubpackets for some or all time segments stored in the FERAM 312according to the user's spreading and scrambling sequence, as well as toits constellation size. In block 906, the decoder 308 attempts to decodethe user packet using the previously demodulated symbols stored in BERAM316 and the demodulated FERAM samples.

In block 910, the decoder 308 or another unit may determine whether theuser(s)'s packet was successfully decoded, i.e., passes an error check,such as using a cyclic redundancy code (CRC).

If the user packet fails to decode, a NAK is sent back to the accessterminal 106 in block 918. If the user packet is correctly decoded, anACK is sent to the access terminal 106 in block 908 and interferencecancellation (IC) is performed in blocks 912-914. Block 912 regeneratesthe user signal according to the decoded signal, the channel impulseresponse and the transmit/receive filters. Block 914 subtracts thecontribution of the user from the FERAM 312, thus reducing itsinterference on users that have not yet been decoded.

Upon both failure and success in the decoding, the receiver moves to thenext user to be decoded in block 916. When an attempt to decode has beenperformed on all users, a new slot is inserted into the FERAM 312 andthe entire process is repeated on the next slot. Samples may be writteninto the FERAM 312 in real time, i.e., the 2× chip rate samples may bewritten in every ½ chip.

FIG. 9B illustrates an apparatus comprising means 930-946 to perform themethod of FIG. 9A. The means 930-946 in FIG. 9B may be implemented inhardware, software or a combination of hardware and software.

Methods for Choosing a Decoding Order

Block 903 indicates TIC may be applied either sequentially to each useror parallel to groups of users. As groups grow larger, theimplementation complexity may decrease but the benefits of TIC maydecrease unless TIC is iterated as described below.

The criteria according to which users are grouped and/or ordered mayvary according to the rate of channel variation, the type of traffic andthe available processing power. Good decoding orders may include firstdecoding users who are most useful to remove and who are most likely todecode. The criteria for achieving the largest gains from TIC mayinclude:

A. Payload Size and T2P: The BTS 104 may group or order users accordingto the payload size, and decode in order starting from those withhighest transmit power, i.e., highest T2P to those with lowest T2P.Decoding and removing high T2P users from the FERAM 312 has the greatestbenefit since they cause the most interference to other users.

B. SINR: The BTS 104 may decode users with higher SINR before users withlower SINR since users with higher SINR have a higher probability ofdecoding. Also, users with similar SINR may be grouped together. In caseof fading channels, the SINR is time varying throughout the packet, andso an equivalent SINR may be computed in order to determine anappropriate ordering.

C. Time: The BTS 104 may decode “older” packets (i.e., those for whichmore subpackets have been received at the BTS 104) before “newer”packets. This choice reflects the assumption that for a given T2P ratioand ARQ termination goal, packets are more likely to decode with eachincremental subpacket.

Methods for Re-Attempting Decoding

Whenever a user is correctly decoded, its interference contribution issubtracted from the FERAM 312, thus increasing the potential ofcorrectly decoding all users that share some slots. It is advantageousto repeat the attempt to decode users that previously failed, since theinterference they see may have dropped significantly. The choose delayblock 902 selects the slot (current or in the past) used as referencefor decoding and IC. The choose users block 903 will select users thatterminate a subpacket in the slot of the chosen delay. The choice ofdelay may be based on the following options:

A. Current decoding indicates a choice of moving to the next (future)slot once all users have been attempted for decoding, and the next slotis available in the FERAM 312. In this case, each user is attempted tobe decoded once per processed slot, and this would correspond tosuccessive interference cancellation.

B. Iterative decoding attempts to decode users more than once perprocessed slot. The second and subsequent decoding iteration willbenefit from the canceled interference of decoded users on previousiterations. Iterative decoding yields gains when multiple users aredecoded in parallel without intervening IC. With pure iterative decodingon the current slot, the choose delay block 902 would simply select thesame slot (i.e., delay) multiple times.

C. Backward decoding: The receiver demodulates subpackets and attemptsto decode a packet based on demodulating all available subpackets in theFERAM corresponding to that packet. After attempting to decode packetswith a subpacket that terminates in the current time slot (i.e., userson the current frame offset), the receiver may attempt to decode packetsthat failed decoding in the previous slot (i.e., users on the previousframe offset). Due to the partial overlap among asynchronous users, theremoved interference of subpackets that terminate in the current slotwill improve the chances of decoding past subpackets. The process may beiterated by going back more slots. The maximum delay in the forward linkACK/NAK transmission may limit backward decoding.

D. Forward decoding: After having attempted to decode all packets withsubpackets that terminate in the current slot, the receiver may alsoattempt to decode the latest users before their full subpacket iswritten into the FERAM. For example, the receiver could attempt todecode users after 3 of their 4 slots of the latest subpacket have beenreceived.

Methods for Updating the BERAM

In a non-TIC BTS receiver, packets are decoded based solely on thedemodulated symbols stored in the BERAM, and the FERAM is used only todemodulate users from the most recent time segments. With TIC, the FERAM312 is still accessed whenever the receiver attempts to demodulate a newuser. However, with TIC, the FERAM 312 is updated after a user iscorrectly decoded based on reconstructing and subtracting out thatuser's contribution. Due to complexity considerations, it may bedesirable to choose the FERAM buffer length to be less than the span ofa packet (e.g., 40 slots are required to span a 16-slot packet in EV-DORevA). As new slots are written into the FERAM 312, they would overwritethe oldest samples in the circular buffer. Therefore, as new slots arereceived the oldest slots are overwritten and the decoder 308 will useBERAM 316 for these old slots. It should be noted that even if a givensubpacket is located in the FERAM 312, the BERAM 316 may be used tostore the demodulator's latest demodulated symbols (determined from theFERAM 312) for that subpacket as an intermediate step in theinterleaving and decoding process. There are two main options for theupdate of the BERAM 316:

A. User-based update: The BERAM 316 for a user is updated only inconjunction with a decoding attempted for that user. In this case, theupdate of the older FERAM slots might not benefit the BERAM 316 for agiven user if that user is not decoded at an opportune time (i.e., theupdated FERAM slots might slide out of the FERAM 312 before that user isattempted to be decoded).

B. Slot-based update: In order to fully exploit the benefits of TIC, theBERAM 316 for all affected users may be updated whenever a slot exitsFERAM 312. In this case, the content of BERAM 316 includes all theinterference subtraction done on the FERAM 312.

Methods for Canceling Interference from Subpackets that Arrive Due to aMissed ACK Deadline

In general, the extra processing used by TIC introduces a delay in thedecoding process, which is particularly relevant when either iterativeor backward schemes are used. This delay may exceed the maximum delay atwhich the ACK may be sent to the transmitter in order to stop thetransmission of subpackets related to the same packet. In this case, thereceiver may still take advantage of successful decoding by using thedecoded data to subtract not only the past subpackets but also thosewhich will be received in the near future due to the missing ACK.

With TIC, the data of decoded users is reconstructed and subtracted sothat the base station 104 may remove the interference it causes to otherusers' subpackets. With H-ARQ, whenever a new subpacket is received,decoding is attempted for the original packet. If decoding issuccessful, then for H-ARQ with TIC, the contribution of that packet maybe canceled from the received samples by reconstructing and subtractingout the component subpackets. Depending on complexity considerations, itis possible to cancel interference from 1, 2, 3 or 4 subpackets bystoring a longer history of samples. In general, IC may be appliedeither sequentially to each user or to groups of users.

FIG. 10 illustrates a receiver sample buffer 312 at three timeinstances: slot time n, n+12 slots and n+24 slots. For illustrativepurposes, FIG. 10 shows a single interlace with subpackets from threeUsers who are on the same frame offset to highlight the interferencecancellation operation with H-ARQ. The receiver sample buffer 312 inFIG. 10 spans all 4 subpackets (which may be achieved for EV-DO RevA bya 40-slot buffer since there are 8 slots between each 4-slot subpacket).Undecoded subpackets are shown as shaded. Decoded subpackets are shownas unshaded in the 40-slot buffer and are canceled. Each time instancecorresponds to the arrival of another subpacket on the interlace. Atslot time n, User 1's four stored subpackets are correctly decoded whilethe latest subpackets from Users 2 and 3 fail to decode.

At time instance n+12 slots, successive subpackets of the interlacearrive with interference cancellation of Users 1's decoded (unshaded)subpackets 2, 3 and 4. During time instance n+12 slots, packets fromUsers 2 and 3 successfully decode.

FIG. 10 applies IC to groups of users who are on the same frame offset,but does not perform successive interference cancellation within thegroup. In classical group IC, users in the same group do not see mutualinterference cancellation. Therefore, as the number of users in a groupgrows larger, the implementation complexity decreases but there is aloss due to the lack of cancellation between users of the same group forthe same decoding attempt. However, with H-ARQ, the receiver wouldattempt to decode all users in the group after each new subpacketarrives, allowing users in the same group to achieve mutual interferencecancellation. For example, when the packet of User 1 decodes at time n,this helps the packets of Users 2 and 3 decode at time n+12, whichfurther helps User 1 decode at time n+24. All subpackets of a previouslydecoded packet may be canceled before reattempting decode for the otherusers when their next subpackets arrive. A key point is that althoughparticular users may always be in the same group, their subpackets seethe IC gain when other group members decode.

Joint Interference Cancellation of Pilot, Overhead, and Traffic Channels

A problem addressed by this section is related to improving systemcapacity of a CDMA RL by efficiently estimating and canceling multi-userinterference at the base station receiver. In general, a RL user'ssignal consists of pilot, overhead and traffic channels. This sectiondescribes a joint pilot, overhead, and traffic IC scheme for all users.

There two aspects described. First, overhead IC (OIC) is introduced. Onthe reverse link, overhead from each user acts as interference tosignals of all other users. For each user, the aggregate interferencedue to overheads by all other users may be a large percentage of thetotal interference experienced by this user. Removing this aggregateoverhead interference may further improve system performance (e.g., fora CDMA2000 1xEV-DO RevA system) and increase reverse link capacitybeyond performance and capacity achieved by PIC and TIC.

Second, important interactions among PIC, OIC, and TIC are demonstratedthrough system performance and hardware (HW) design tradeoffs. A fewschemes are described on how to best combine all three cancellationprocedures. Some may have more performance gain, and some may have morecomplexity advantage. For example, one of the described schemes removesall the pilot signals before decoding any overhead and traffic channels,then decodes and cancels the users' overhead and traffic channels in asequential manner.

This section is based on CDMA2000 1x EV-DO RevA systems and in generalapplies to other CDMA systems, such as W-CDMA, CDMA2000 1x, and CDMA20001x EV-DV.

Methods for Overhead Channels Cancellation

FIG. 11 illustrates a RL overhead channels structure, such as for EV-DORevA. There are two types of overhead channels: one type is to assistthe RL demodulation/decoding which includes the RRI (reverse rateindicator) channel and the auxiliary pilot channel (used when payloadsize is 3072 bits or higher); the other type is to facilitate theforward link (FL) functioning which includes DRC (data rate control)channel, DSC (data source control), and ACK (acknowledge) channel. Asshown in FIG. 11, ACK and DSC channels are time-multiplexed on a slotbase. ACK channel is only transmitted when acknowledging a packettransmitted to the same user on FL.

Among the overhead channels, the data of the auxiliary pilot channel isknown a priori at the receiver. Therefore, similar to primary pilotchannel, no demodulation and decoding are necessary for this channel,and the auxiliary pilot channel may be reconstructed based on knowledgeabout the channel. The reconstructed auxiliary pilot may be at 2× chiprate resolution and may be represented as (over one segment)

${{p_{f}\left\lbrack {{2n} + \delta_{f}} \right\rbrack} = {\sum\limits_{\mu = {- M}}^{M}\;{{c_{f}\left\lbrack {n - \mu} \right\rbrack}\mspace{11mu}{{w_{f,{aux}}\left\lbrack {n - \mu} \right\rbrack} \cdot G_{aux} \cdot \left( {h_{f}{\phi\left\lbrack {{8\mu} - \alpha_{f}} \right\rbrack}} \right)}}}},{n = 0},\ldots\mspace{11mu},511$${{p_{f}\left\lbrack {{2n} + \delta_{f} + 1} \right\rbrack} = {\sum\limits_{\mu = {- M}}^{M}\;{{c_{f}\left\lbrack {n - \mu} \right\rbrack}\mspace{11mu}{{w_{f,{aux}}\left\lbrack {n - \mu} \right\rbrack} \cdot G_{aux} \cdot \left( {h_{f}{\phi\left\lbrack {{8\mu} + 4 - \alpha_{f}} \right\rbrack}} \right)}}}},{n = 0},\ldots\mspace{11mu},511$

Equation 1 Reconstructed Auxiliary Pilot Signals

where n corresponds to chip×1 sampling rate, f is the finger number,c_(f) is the PN sequence, w_(f,aux) is the Walsh code assigned to theauxiliary pilot channel, G_(aux) is the relative gain of this channel tothe primary pilot, h_(f) is the estimated channel coefficient (orchannel response) which is assumed to be a constant over one segment, φis the filter function or convolution of the transmit pulse and thereceiver low-pass filter of chip×8 resolution (φ is assumednon-negligible in [−MT_(c), MT_(c)]), γ_(f) is the chip×8 time offset ofthis finger with α_(f)=γ_(f) mod 4 and δ_(f)=└γ_(f)/4┘.

The second group of overhead channels, which includes DRC, DSC, and RRIchannels, are encoded by either bi-orthogonal codes or simplex codes. Onthe receiver side, for each channel, the demodulated outputs are firstcompared with a threshold. If the output is below the threshold, anerasure is declared and no reconstruction is attempted for this signal.Otherwise, they are decoded by a symbol-based maximum-likelihood (ML)detector, which may be inside the decoder 308 in FIG. 4. The decodedoutput bits are used for reconstruction of the corresponding channel, asshown in FIG. 4. The reconstructed signals for these channels are givenas:

${{\sigma_{f}\left\lbrack {{2n} + \delta_{f}} \right\rbrack} = {\sum\limits_{\mu = {- M}}^{M}\;{{c_{f}\left\lbrack {n - \mu} \right\rbrack}\mspace{11mu}{{w_{f,o}\left\lbrack {n - \mu} \right\rbrack} \cdot d_{o}}{G_{o} \cdot \left( {h_{f}{\phi\left\lbrack {{8\mu} - \alpha_{f}} \right\rbrack}} \right)}}}},{n = 0},\ldots\mspace{11mu},{{511{\sigma_{f}\left\lbrack {{2n} + \delta_{f} + 1} \right\rbrack}} = {\sum\limits_{\mu = {- M}}^{M}\;{{c_{f}\left\lbrack {n - \mu} \right\rbrack}\mspace{11mu}{{w_{f,o}\left\lbrack {n - \mu} \right\rbrack} \cdot d_{o}}{G_{o} \cdot \left( {h_{f}{\phi\left\lbrack {{8\mu} + 4 - \alpha_{f}} \right\rbrack}} \right)}}}},{n = 0},\ldots\mspace{11mu},511$

Equation 2 Reconstructed Overhead (DRC, DSC, and RRI) Signals

Compared with Eq. 1, there is one new term d_(o) which is the overheadchannel data, w_(f,o) is the Walsh cover, and G_(aux) represents theoverhead channel gain relative to the primary pilot.

The remaining overhead channel is the 1-bit ACK channel. It may be BPSKmodulated, un-coded and repeated over half a slot. The receiver maydemodulate the signal and make a hard-decision on the ACK channel data.The reconstruction signal model may be the same as Eq. 2.

Another approach to reconstruct the ACK channel signal assumes thedemodulated and accumulated ACK signal, after normalization, may berepresented as:y=x+z,where x is the transmitted signal, and z is the scaled noise term withvariance of σ². Then, the log-likelihood ratio (LLR) of y is given as

$L = {{\ln\frac{\Pr\mspace{11mu}\left( {x = \left. 1 \middle| y \right.} \right)}{\Pr\mspace{11mu}\left( {x = \left. {- 1} \middle| y \right.} \right)}} = {\frac{2}{\sigma^{2}}{y.}}}$Then, for the reconstruction purpose, a soft estimate of the transmittedbit may be:

${\hat{x} = {{{\Pr\mspace{11mu}{\left( {x = 1} \right) \cdot 1}} + {\Pr\mspace{11mu}{\left( {x = {- 1}} \right) \cdot \left( {- 1} \right)}}} = {\frac{{\exp(L)} - 1}{{\exp(L)} + 1} = {{\tanh\mspace{11mu}(L)} = {\tanh\mspace{11mu}\left( {\frac{2}{\sigma^{2}}y} \right)}}}}},$where the tan h function may be tabulated. The reconstructed ACK signalis very similar to Eq. 2 but with the exception of replacing d₀ by{circumflex over (x)}. In general, the soft estimate and cancellationapproach should give a better cancellation performance since thereceiver does not know the data for sure and this method brings theconfidence level into picture. This approach in general may be extendedto overhead channels mentioned above. However, the complexity of themaximum aposteriori probability (MAP) detector to obtain the LLR foreach bit grows exponentially with the number of information bits in onecode symbol.

One efficient way to implement overhead channel reconstruction is onefinger, may scale each decoded overhead signal by its relative gain,cover it by the Walsh code, and sum them together, then spread by one PNsequence and filter through the channel-scaled filter hφ all at once.This method may save both computation complexity and memory bandwidthfor subtraction purpose.

$\sum\limits_{f}\;{c_{f}{d_{f} \cdot h_{f}}\phi\mspace{14mu}{{becomes}{\mspace{11mu}\;}\left( {\sum\limits_{f}\;{c_{f}{d_{f} \cdot h_{f}}}} \right)}\mspace{11mu}\phi}$Joint PIC, OIC, and TIC

Joint PIC, OIC and TIC may be performed to achieve high performance andincrease system capacity. Different decoding and cancellation orders ofPIC, OIC and TIC may yield different system performance and differentimpacts on hardware design complexity.

PIC First then OIC and TIC Together (First Scheme)

FIG. 12A illustrates a method to first perform PIC and then perform OICand TIC together. After a start block 1200, the receiver derives channelestimation for all users and performs power control in block 1202. Sincethe pilot data for all users are known at BTS, they may be subtractedonce their channels are estimated in PIC block 1204. Therefore, allusers' traffic channels and certain overhead channels observe lessinterference and are able to benefit from the in-front pilotcancellation.

Block 1206 chooses a group G of undecoded users, e.g., whose packets orsubpackets terminate at current slot boundary. Blocks 1208-1210 performoverhead/traffic channel demodulation and decoding. In block 1212, onlythe successfully decoded channel data will be reconstructed andsubtracted from the front-end RAM (FERAM) 312 shared by all users. Block1214 checks whether there are more users to decode. Block 1216terminates the process.

The decoding/reconstruction/cancellation may be in a sequential fashionfrom one user in a group to the next user in the group, which may becalled successive interference cancellation. In this approach, users inlate decoding order of the same group benefits from the cancellations ofusers in earlier decoding order. A simplified approach is to decode allusers in the same group first, and then subtract their interferencecontributions all at once. The second approach or scheme (describedbelow) allows both lower memory bandwidth and more efficient pipelinearchitecture. In both cases, the users' packets which do not terminateat the same slot boundary but overlap with this group of packets benefitfrom this cancellation. This cancellation may account for a majority ofthe cancellation gain in an asynchronous CDMA system.

FIG. 12B illustrates an apparatus comprising means 1230-1244 to performthe method of FIG. 12A. The means 1230-1244 in FIG. 12B may beimplemented in hardware, software or a combination of hardware andsoftware.

FIG. 13A illustrates a variation of the method in FIG. 12A. Blocks1204-1210 remove a signal based on an initial channel estimate in block1202. Block 1300 derives a data-based channel estimate or a refinedchannel estimate. Data-based channel estimate may provide a betterchannel estimate, as described below. Block 1302 performs residual PIC,i.e., removes a revised estimate of the signal based on a refinement ofthe channel estimate in block 1300.

For example, consider that blocks 1204-1210 resulted in removing aninitial signal estimate (e.g., pilot signal) P1[n] from the receivedsamples. Then, based on a better channel estimate derived in block 1300,the method forms the revised signal estimate P2[n]. The method may thenremove the incremental P2[n]−P1[n] difference from the sample locationsin the RAM 312.

FIG. 13B illustrates an apparatus comprising means 1230-1244, 1310, 1312to perform the method of FIG. 13A. The means 1230-1244, 1310, 1312 inFIG. 13B may be implemented in hardware, software or a combination ofhardware and software.

PIC First, then OIC, and then TIC (Second Scheme)

This second scheme is similar to FIG. 12A described above with theexception that overhead channels of the same group of users aredemodulated and decoded before any traffic channels are demodulated anddecoded. This scheme is suitable for a non-interlaced system since nostrict ACK deadline is imposed. For an interlaced system, e.g., DO Rev.A, since ACK/NAK signals respond to the traffic channel subpackets, thetolerable decoding delay for traffic channel subpackets in general arelimited to within a couple slots (1 slot=1.67 ms). Therefore, if certainoverhead channels spread over more than this time scale, this scheme maybecome unfeasible. In particular, on DO RevA, auxiliary pilot channeland ACK channel are in a short-duration format and may be subtractedbefore TIC.

Joint Pilot/Overhead/Traffic Channel Cancellation (The Third Scheme)

FIG. 14A illustrates a method to perform joint PIC, OIC and TIC. After astart block 1400, the receiver derives channel estimation for all usersand performs power control in block 1402. Block 1404 chooses a group Gof undecoded users. Block 1406 re-estimates the channel from pilots.Blocks 1408-1410 attempt to perform overhead/traffic channeldemodulation and decoding. Block 1412 performs PIC for all users and OICand TIC for only users with successfully decoded channel data.

Different from the first scheme (FIG. 12A) discussed above, after thechannel estimation for all users (block 1402), the pilots are notsubtracted from FERAM 312 right away and the channel estimation is usedfor power control as the non-IC scheme. Then, for a group of users whoterminated at the same packet/subpacket boundary, the method performssequential decoding (blocks 1408 and 1410) in a given order.

For an attempted decoding user, the method first re-estimates thechannel from the pilot (block 1402). The pilot sees less interferencecompared to the time (block 1402) when it was demodulated for powercontrol due to interference cancellation of previously decoded packetswhich overlap with the to-be-decoded traffic packet. Therefore, thechannel estimation quality is improved, which benefits both trafficchannel decoding and cancellation performance. This new channelestimation is used for traffic channel decoding (block 1410) as well ascertain overhead channel decoding (block 1408) (e.g., RRI channel inEV-DO). Once the decoding process is finished for one user at block1412, the method will subtract this user's interference contributionfrom the FERAM 312, which includes its pilot channel and any decodedoverhead/traffic channel.

Block 1414 checks whether there are more users to decode. Block 1416terminates the process.

FIG. 14B illustrates an apparatus comprising means 1420-1436 to performthe method of FIG. 14A. The means 1420-1436 in FIG. 14B may beimplemented in hardware, software or a combination of hardware andsoftware.

FIG. 15A illustrates a variation of the method in FIG. 14A. Block 1500derives data-based channel estimates. Block 1502 performs an optionalresidual PIC as in FIG. 13A.

FIG. 15B illustrates an apparatus comprising means 1420-1436, 1510, 1512to perform the method of FIG. 15A. The means 1420-1436, 1510, 1512 inFIG. 15B may be implemented in hardware, software or a combination ofhardware and software.

Tradeoffs Between the First and Third Schemes

It may appear that first scheme should have superior performancecompared to the third scheme since the pilot signals are known at theBTS and it makes sense to cancel them in front. If both schemes areassumed to have the same cancellation quality, the first scheme mayoutperform the third scheme throughout all data rates. However, for thefirst scheme, since the pilot channel estimation sees higherinterference than the traffic data demodulation, the estimated channelcoefficients used for reconstruction purpose (for both pilot andoverhead/traffic) may be noisier. However, for the third scheme, sincethe pilot channel estimation is redone right before the traffic datademodulation/decoding, the interference level seen by this refinedchannel estimation is the same as the traffic data demodulation. Then,on average, the cancellation quality of the third scheme may be betterthan the first scheme.

From a hardware design perspective, the third scheme may have a slightedge: the method may sum the pilot and decoded overhead and trafficchannel data and cancel them together, therefore, this approach savesmemory bandwidth. On the other hand, the re-estimation of pilot may beperformed together with either overhead channel demodulation or trafficchannel demodulation (in terms of reading samples from memory), andthus, there is no increase on memory bandwidth requirements.

If it is assumed that the first scheme has 80% or 90% cancellationquality of the third scheme, there are tradeoffs between data rate peruser verse gain on number of users. In general, it favors the firstscheme if all users are in low data rates region and the opposite if allhigh data rate users. The method may also re-estimate the channel fromthe traffic channel once one packet of data is decoded. The cancellationquality shall improve since the traffic channel operates at (much)higher SNR compared to the pilot channel.

Overhead channels may be removed (canceled) once they are demodulatedsuccessfully, and traffic channels may be removed once they have beendemodulated and decoded successfully. It is possible that the basestation could successfully demodulate/decode the overhead and trafficchannels of all the access terminals at some point in time. If this(PIC, OIC, TIC) occurs, then the FERAM would only contain residualinterference and noise. Pilot, overhead and traffic channel data may becanceled in various orders, and canceled for subsets of accessterminals.

One approach is to perform interference cancellation (of any combinationof PIC, TIC and OIC) for one user at a time from the RAM 312. Anotherapproach is to (a) accumulate reconstructed signals (of any combinationof PIC, TIC and OIC) for a group of users and (b) then performinterference cancellation for the group at the same time. These twoapproaches may be applied to any of the methods, schemes, and processesdisclosed herein.

Improving Channel Estimation for Interference Cancellation

The ability to accurately reconstruct received samples may significantlyaffect system performance of a CDMA receiver that implementsinterference cancellation by reconstructing and removing variouscomponents of transmitted data. In a RAKE receiver, a multipath channelis estimated by PN despreading with respect to the pilot sequence andthen pilot filtering (i.e., accumulating) over an appropriate period oftime. The length of the pilot filtering is typically chosen as acompromise between increasing the estimation SNR by accumulating moresamples, while not accumulating so long that the estimation SNR isdegraded by the time variations of the channel. The channel estimatefrom the pilot filter output is then used to perform data demodulation.

As described above with FIG. 4, one practical method of implementinginterference cancellation in a CDMA receiver is to reconstruct thecontribution of various transmitted chip×1 streams to the (e.g. chip×2)FERAM samples. This involves determining the transmitted chip streamsand an estimate of the overall channel between the transmitter chips andthe receiver samples. Since the channel estimates from the RAKE fingersrepresent the multipath channel itself, the overall channel estimateshould also account for the presence of transmitter and receiverfiltering.

This section discloses several techniques for improving this overallchannel estimation for interference cancellation in a CDMA receiver.These techniques may be applicable to CDMA2000, 1xEV-DO, 1xEV-DV, WCDMA.

To perform TIC of a packet that decodes correctly, the receiver in FIG.4 may take the information bits from the decoder output and reconstructthe transmitted chip stream by re-encoding, re-interleaving,re-modulating, re-applying the data channel gain, and re-spreading. Toestimate the received samples for TIC with the pilot channel estimate,the transmit chip stream would be convolved with a model of thetransmitter and receiver filters and the RAKE receiver's channelestimate from despreading with the pilot PN sequence.

Instead of using the pilot channel estimate, an improved channelestimate (at each RAKE finger delay) may be obtained by despreading withthe reconstructed data chips themselves. This improved channel estimateis not useful for data demodulation of the packet since the packet hasalready decoded correctly, but is rather used solely for reconstructingthe contribution of this packet to the front-end samples. With thistechnique, for each of the delays of the RAKE fingers (e.g., chip×8resolution), the method may “despread” the received samples (e.g.,interpolated to chip×8) with the reconstructed data chip stream andaccumulate over an appropriate period of time. This will lead toimproved channel estimation since the traffic channel is transmitted athigher power than the pilot channel (this traffic-to-pilot T2P ratio isa function of data rate). Using the data chips to estimate the channelfor TIC may result in a more accurate channel estimate for the higherpowered users who are the most important to cancel with high accuracy.

Instead of estimating the multipath channel at each of the RAKE fingerdelays, this section also describes a channel estimation procedure thatwould explicitly estimate a combined effect of the transmitter filter,multipath channel, and receiver filter. This estimate may be at the sameresolution as the oversampled front-end samples (e.g. chip×2 FERAM). Thechannel estimate may be achieved by despreading the front-end sampleswith the reconstructed transmit data chips to achieve the T2P gain inchannel estimation accuracy. The time span of the uniformly spacedchannel estimates may be chosen based on information about the RAKEfinger delays and an a priori estimate of a combined response of thetransmitter and receiver filters. Furthermore, information from the RAKEfingers may be used to refine the uniformly spaced channel estimates.

FIG. 16 illustrates a model of transmission system with a transmitfilter p(t), overall/composite channel h(t) (vs. multipath channel g(t)described below), and receiver filter q(t). The digital basebandrepresentation of wireless communications channel may be modeled by Ldiscrete multipath components

$\begin{matrix}{{g\mspace{11mu}(t)} = {\sum\limits_{l = 1}^{L}\;{a_{l}\delta\mspace{11mu}\left( {t - \tau_{l}} \right)}}} & {{Equation}\mspace{14mu} 3}\end{matrix}$where the complex path amplitudes are a_(l) with corresponding delaysτ_(l). The combined effect of the transmitter and receiver filters maybe defines as φ(t), whereφ(t)=p(t){circle around (x)}q(t)  Equation 4where {circle around (x)} denotes convolution. The combined φ(t) isoften chosen to be similar to a raised cosine response. For example, inCDMA2000 and its derivatives, the response is similar to an example φ(t)displayed in FIG. 17. The overall channel estimate is given by

$\begin{matrix}{{\hat{h}\mspace{11mu}(t)} = {{g\mspace{11mu}{(t) \otimes \phi}\mspace{11mu}(t)} = {\sum\limits_{l = 1}^{L}\;{a_{l}\phi\mspace{11mu}\left( {t - \tau_{l}} \right)}}}} & {{Equation}\mspace{14mu} 5}\end{matrix}$

FIGS. 18A and 18B show an example of channel estimation (real andimaginary components) based on the estimated multipath channel at eachof three RAKE fingers. In this example, the actual channel is shown as asolid line, and the a_(l) are given by the stars. The reconstruction(dotted line) is based on using the a_(l) in Equation 3 above. The RAKEfinger channel estimates in FIGS. 18A and 18B are based on despreadingwith pilot chips (where the overall pilot SNR is −24 dB).

Despreading at RAKE Finger Delays with Regenerated Data Chips Instead ofPilot Chips

The quality of channel estimation has a direct impact on the fidelity ofreconstructing a user's contribution to the received signal. In order toimprove the performance of CDMA systems that implement interferencecancellation, it is possible to use a user's reconstructed data chips todetermine an improved channel estimate. This will improve the accuracyof the interference subtraction. One technique for CDMA systems may bedescribed as “despreading with respect to a user's transmitted datachips” as opposed to the classical “despreading with respect to a user'stransmitted pilot chips.”

Recall that the RAKE finger channel estimates in FIGS. 18A-18B are basedon despreading with the pilot chips (where the overall pilot SNR is −24dB). FIGS. 19A-19B show examples of an improved channel estimate basedon RAKE fingers and despreading with the data chips, where the datachips are transmitted with 10 dB more power than the pilot chips.

FIG. 20A illustrates a method for despreading at RAKE finger delays withregenerated data chips. In block 2000, rake receiver 314 (FIG. 4)despreads front-end samples with pilot PN chips to get RAKE fingervalues. In block 2002, demodulator 304 performs data demodulation. Inblock 2004, decoder 308 performs data decoding and checks CRC. In block2006, if CRC passes, unit 400 determines transmitted data chips byre-encoding, re-interleaving, re-modulating and re-spreading. In block2008, unit 400 despreads front-end samples with transmitted data chipsto get improved channel estimate at each finger delay. In block 2010,unit 400 reconstructs user's traffic and overhead contribution tofront-end samples with improved channel estimate.

FIG. 20B illustrates an apparatus comprising means 2020-2030 to performthe method of FIG. 20A. The means 2020-2030 in FIG. 20B may beimplemented in hardware, software or a combination of hardware andsoftware.

Estimating the Composite Channel at FERAM Resolution with RegeneratedData Chips

Classical CDMA receivers may estimate the complex value of the multipathchannel at each of the RAKE finger delays. The receiver front-end priorto the RAKE receiver may include a low pass receiver filter (i.e., q(t))which is matched to the transmitter filter (i.e., p(t)). Therefore, forthe receiver to implement a filter matched to the channel output, theRAKE receiver itself attempts to match to the multipath channel only(i.e., g(t)). The delays of the RAKE fingers are typically driven fromindependent time-tracking loops within minimum separation requirements(e.g., fingers are at least one chip apart). However, the physicalmultipath channel itself may often have energy at a continuum of delays.Therefore, one method estimates the composite channel (i.e., h(t)) atthe resolution of the front-end samples (e.g., chip×2 FERAM).

With transmit power control on the CDMA reverse link, the combinedfinger SNR from all multipaths and receiver antennas is typicallycontrolled to lie in a particular range. This range of SNR may result ina composite channel estimate derived from the despread pilot chips thathas a relatively large estimation variance. That is why the RAKEreceiver attempts to only place fingers at the “peaks” of the energydelay profile. But with the T2P advantage of despreading withreconstructed data chips, the composite channel estimation may result ina better estimate of h(t) than the direct estimate of g(t) combined witha model of φ(t).

A channel estimation procedure described herein explicitly estimates thecombined effect of the transmitter filter, multipath channel, andreceiver filter. This estimate may be at the same resolution as theoversampled front-end samples (e.g., chip×2 FERAM). The channel estimatemay be achieved by despreading the front-end samples with thereconstructed transmit data chips to achieve the T2P gain in channelestimation accuracy. The time span of the uniformly spaced channelestimates may be chosen based on information about the RAKE fingerdelays and an a priori estimate of the combined response of thetransmitter and receiver filters. Furthermore, information from the RAKEfingers may be used to refine the uniformly spaced channel estimates.Note that the technique of estimating the composite channel itself isalso useful because it does not require the design to use an a prioriestimate of φ(t).

FIGS. 21A, 21B show an example of estimating the composite channel usinguniformly spaced samples at chip×2 resolution. In FIGS. 21A, 21B, thedata chips SNR is −4 dB, corresponding to a pilot SNR of −24 dB and aT2P of 20 dB. The uniform channel estimate gives a better qualitycompared with despreading with the data chips only at the RAKE fingerlocations. At high SNR, the effects of “fatpath” limit the ability toaccurately reconstruct the channel using RAKE finger locations. Theuniform sampling approach is particularly useful when the estimation SNRis high, corresponding to the case of despreading with data chips for ahigh T2P. When the T2P is high for a particular user, the channelreconstruction fidelity is important.

FIG. 22A illustrates a method for estimating composite channel atuniform resolution using regenerated data chips. Blocks 2000-2006 and2010 are similar to FIG. 20A described above. In block 2200, RAKEreceiver 314 (FIG. 4) or another component determines time-span foruniform construction based on RAKE finger delays. In block 2202,demodulator 304 or another component determines an improved channelestimate by despreading front-end samples with transmitted data chips atuniform delays for an appropriate time-span.

FIG. 22B illustrates an apparatus comprising means 2020-2030, 2220, 2222to perform the method of FIG. 22A. The means 2020-2030 in FIG. 22B maybe implemented in hardware, software or a combination of hardware andsoftware.

In the description above, g(t) is the wireless multipath channel itself,while h(t) includes the wireless multipath channel as well as thetransmitter and receiver filtering: h(t)=g(t) convolved with phi(t).

In the description above, “samples” may be at any arbitrary rate (e.g.,twice per chip), but “data chips” are one per chip.

“Regenerated data chips” are formed by re-encoding, re-interleaving,re-modulating, and re-spreading, as shown in block 2006 of FIG. 20A anddescribed above. In principle, “regenerating” is mimicking the processthat the information bits went through at the mobile transmitter (accessterminal).

“Reconstructed samples” represent the samples stored in FERAM 312 or ina separate memory from FERAM 312 in the receiver (e.g., twice per chip).These reconstructed samples are formed by convolving the (regenerated)transmitted data chips with a channel estimate.

The words “reconstructed” and “regenerated” may be used interchangeablyif context is provided to either reforming the transmitted data chips orreforming the received samples. Samples or chips may be reformed, since“chips” are reformed by re-encoding, etc., whereas “samples” arereformed based on using the reformed chips and incorporating the effectsof the wireless channel (channel estimate) and the transmitter andreceiver filtering. Both words “reconstruct” and “regenerate”essentially mean to rebuild or reform. There is no technicaldistinction. One embodiment uses “regenerate” for data chips and“reconstruct” for samples exclusively. Then, a receiver may have a datachip regeneration unit and a sample reconstruction unit.

Adaptation of Transmit Subchannel Gains on the Reverse Link of CDMASystems with Interference Cancellation

Multi-user interference is a limiting factor in a CDMA transmissionsystem and any receiver technique that mitigates this interference mayallow significant improvements in the achievable throughput. Thissection describes techniques for adapting the transmit subchannels gainsof a system with IC.

In the reverse link transmission, each user transmits pilot, overheadand traffic signals. Pilots provide synchronization and estimation ofthe transmission channel. Overhead subchannels (such as RRI, DRC, DSC,and ACK) are needed for MAC and traffic decoding set-up. Pilot, overheadand traffic subchannels have different requirements on the signal tointerference plus noise ratio (SINR). In a CDMA system, a single powercontrol may adapt the transmit power of pilots, while the power ofoverhead and traffic subchannels has a fixed gain relative to thepilots. When the BTS is equipped with PIC, OIC and TIC, the varioussubchannels see different levels of interference depending on the orderof ICs and the cancellation capabilities. In this case, a staticrelation between subchannel gains may hurt the system performance.

This section describes new gain control strategies for the differentlogical subchannels on a system that implements IC. The techniques arebased on CDMA systems such as EV-DO RevA and may be applied to EV-DV RelD, W-CDMA EUL, and cdma2000.

The described techniques implement power and gain control on differentsubchannels by adaptively changing the gain of each subchannel accordingto the measured performance in terms of packet error rate, SINR orinterference power. The aim is to provide a reliable power and gaincontrol mechanism that allows fully exploiting the potentials of ICwhile providing robustness for a transmission on a time-varyingdispersive subchannel.

Interference cancellation refers to removing a contribution of logicalsubchannels to the front-end samples after those subchannels have beendecoded, in order to reduce the interference on other signals that willbe decoded later. In PIC, the transmitted pilot signal is known at theBTS and the received pilot is reconstructed using the channel estimate.In TIC or OIC, the interference is removed by reconstructing thereceived subchannel through its decoded version at the BTS.

Current BTS (with no IC) control the power of the pilot subchannelE_(cp) in order to meet the error rate requirements in the trafficchannel. The power of the traffic subchannel is related to pilots by afixed factor T2P, which depends on the payload type and targettermination goals. The adaptation of the pilot power is performed byclosed loop power control mechanism including an inner and outer loop.The inner loop aims at keeping the SINR of the pilots (Ecp/Nt) at athreshold level T, while the outer-loop power control changes thethreshold level T, for example, based on packet error rate (PER).

When IC is performed at the receiver (FIG. 4), the adaptation of thesubchannel gains may be beneficial to the system. In fact, since eachsubchannel sees a different level of interference, their gain withrespect to pilots should be adapted accordingly in order to provide thedesired performance. This section may solve the problem of gain controlfor overhead and pilot subchannels, and techniques are described for theadaptation of T2P which increase the throughput of the system by fullyexploiting the IC.

Important Parameters in a System with IC

Two parameters that may be adjusted are overhead subchannel gains andtraffic to pilot (T2P) gain. When TIC is active, the overhead subchannelgains may be increased (relative to non-TIC), in order to allow a moreflexible trade-off between the pilot and overhead performance. Bydenoting with G the baseline G used in the current system, the new valueof the overhead channel gain will be:G′=G·Δ _(G).

In no-IC schemes the overhead/pilot subchannels see the sameinterference level as the traffic channels and a certain ratio T2P/G maygive satisfactory performance for both overhead and traffic channelsperformance as well as pilot channel estimations. When IC is used, theinterference level is different for the overhead/pilots and traffic, andT2P may be reduced in order to allow coherent performance of the twotypes of subchannels. For a given payload, the method may let the T2Pdecrease by a factor Δ_(T2P) with respect to the tabulated value, inorder to satisfy the requirements. By denoting with T2P the baseline T2Pused for a particular payload in the current system, the new value ofT2P will be:T2P′=T2P·Δ _(T2P)

The parameter Δ_(T2P) can be quantized into a set of finite or discretevalues (e.g., −0.1 dB to −1.0 dB) and sent to the access terminal 106.

Some quantities that may be kept under control are traffic PER, pilotSINR, and rise over thermal. The pilot SINR should not drop under theminimum level desired for good channel estimation. Rise over thermal(ROT) is important to ensure the stability and the link-budget of thepower controlled CDMA reverse link. In non-TIC receivers, ROT is definedon the received signal. In general, ROT should stay within apredetermined range to allow for a good capacity/coverage tradeoff.

Rise Over Thermal Control

I₀ indicates the power of the signal at the input of the receiver. Thecancellation of interference from the received signal yields a reductionof power. I₀′ indicates the average power of the signal at input of thedemodulator 304 after IC:I₀′≦I₀.The value of I₀′ may be measured from the front-end samples after it hasbeen updated with the IC. When IC is performed, the ROT is stillimportant for the overhead subchannel, and ROT should be controlled withrespect to a threshold, i.e. to ensure that

${{ROT} = {\frac{I_{0}}{N_{0}} < {ROT}_{thr}}},$where N₀ is the noise power.

However, traffic and some overhead subchannels benefit also from the IC.The decoding performance of these subchannels is related to the riseover thermal, measured after IC. Effective ROT is the ratio between thesignal power after IC and the noise power. The effective ROT may becontrolled by a threshold, i.e.,

${ROT}_{eff} = {\frac{I_{0}^{\prime}}{N_{0}} < {{ROT}_{thr}^{({eff})}.}}$The constraint on the ROT_(eff) may be equivalently stated as aconstraint on I₀′, under the assumption that the noise level does notchange:I₀′≦I₀ ^((thr)),where I₀ ^((thr)) is the signal power threshold corresponding toROT_(thr) ^((eff)).Fixed Overhead Gain Techniques

When the ROT increases, the SINR of the pilot and overhead channels(which do not benefit from IC) decreases, leading to a potentialincrease in the erasure rate. In order to compensate for this effect,the overhead channel gains may be raised, either by a fixed value or byadaptation to the particular system condition.

Techniques are described where the gain of the overhead subchannel isfixed with respect to the pilots. The proposed techniques adapt both thelevel of pilot subchannel and the Δ_(T2P) for each user.

Closed Loop Control of T2P with Fixed Δ_(G)=0 dB

FIG. 23 illustrates a closed loop power control (PC) for E_(cp) andΔ_(T2P) and fixed Δ_(G)=0 dB (block 2308). This first solution for theadaptation of Δ_(T2P) and E_(cp) comprises:

A. Inner and outer loops 2300, 2302 may perform power control in aconventional manner for the adaptation of E_(cp). Outer loop 2300receives target PER and traffic PER. Inner loop 2304 receives athreshold T 2302 and a measured pilot SINR and outputs E_(cp).

B. A closed loop gain control (GC) 2306 adapts Δ_(T2P) based on themeasure of the removed interference. The gain control 2306 receivesmeasured ROT and measured ROTeff and outputs Δ_(T2P). The receivermeasures the interference removed by the IC scheme and adapts Δ_(T2P).

C. Δ_(T2P) can be sent in a message to all access terminals 106 in asector periodically.

For the adaptation of Δ_(T2P), if the interference after IC is reducedfrom I₀ to I₀′, the T2P can be consequently reduced of the quantity:

$\Delta_{T2P} = {\frac{I_{0}^{\prime}}{I_{0}} \approx {\frac{{ROT}_{eff}}{ROT}.}}$

The E_(cp) will increase (through the PC loop 2304) as:

$E_{cp}^{\prime} = {\frac{I_{0}}{I_{0}^{({thr})}}{E_{cp}.}}$

The ratio between the total transmit power for the system with andwithout IC will be:

${C = \frac{E_{cp}\left( {1 + G + {T\; 2P}} \right)}{E_{cp}^{\prime}\left( {1 + G + {{T2}\; P^{\prime}}} \right)}},$where G is the overhead channel gain. For large values of T2P (withrespect to G), the ratio C can be approximated as:

$C \approx {\frac{I_{0}^{({thr})}}{I_{0}^{\prime}}.}$

For the estimation of the effective ROT, the effective ROT changesrapidly due to both PC and changes in channel conditions. Instead,Δ_(T2P) reflects slow variations of the ROT_(eff). Hence, for the choiceof Δ_(T2P) the effective ROT is measured by means of a long averagingwindow of the signal after IC. The averaging window may have a length atleast twice as long as a power control update period.

Closed Loop Control of T2P with Fixed Δ_(G)>0 dB

FIG. 24 is the same as FIG. 23 except the gain control 2306 receives athreshold effective ROT, and Δ_(G)>0 dB (block 2400). This alternativemethod for the adaptation of Δ_(T2P) is based on the request of havingthe same cell coverage for both IC and no-IC systems. The E_(cp)distribution is the same in both cases. The effect of IC is twofold on afully loaded system: i) the signal power before IC, I₀, will increasewith respect to the signal power of the system with no IC; ii) due toclosed-loop power control by PER control, I₀′ will tend to be similar tothe signal power of the system with no IC. Δ_(T2P) is adapted asfollows:

$\Delta_{T2P} = {\frac{I_{0}^{({thr})}}{I_{0}^{\prime}} \approx {\frac{{ROT}_{thr}^{({eff})}}{{ROT}_{eff}}.}}$ACK-Based Control of Δ_(T2P)

FIG. 25 illustrates PC for E_(cp) and Δ_(T2P) based on the ACKsubchannel with fixed overhead subchannel gain (block 2506).

The closed loop GC of Δ_(T2P) requires a feedback signal from the BTS tothe AT, where all ATs receive the same broadcast value of Δ_(T2P) from aBTS. An alternative solution is based on an open-loop GC of Δ_(T2P) 2510and a closed loop PC 2500, 2504 for the pilots. The closed loop pilot PCcomprises an inner loop 2504, which adjusts the E_(cp) according to athreshold value T_(o) 2502. The outer loop control 2500 is directed bythe erasure rate of the overhead subchannels, e.g., the data ratecontrol (DRC) subchannel error probability or DRC erasure rate. T_(o) isincreased whenever the DRC erasure rate exceeds a threshold, but isgradually decreased when the DRC erasure rate is below the threshold.

The Δ_(T2P) is adapted through the ACK forward subchannel. Inparticular, by measuring the statistics of the ACK and NACK, the AT canevaluate the traffic PER (block 2508) at the BTS. A gain control 2510compares target traffic PER and measured PER. Whenever the PER is higherthan a threshold, the Δ_(T2P) is increased, until T2P′ reached thebaseline value T2P of the no-IC system. On the other hand, for a lowerPER, the Δ_(T2P) is decreased in order to fully exploit the IC process.

Variable Overhead Gain Techniques

A further optimization of the transceiver can be obtained by adaptingnot only Δ_(T2P) but also the overhead subchannel gains (G overhead) tothe IC process. In this case, an extra feedback signal is needed. Thevalues of Δ_(G) can be quantized from 0 dB to 0.5 dB.

Interference Power-Based Overhead Gain Control

FIG. 26 is similar to FIG. 24 except with overhead GC 2600. A method forGC of the overhead subchannel 2600 is based on the measured signal powerafter the IC. In this case, the E_(cp) is assumed in order to providethe same cell converge of a system with no IC. The signal before IC hasan increased power I₀ and the overhead gain compensates for theincreased interference. This implementation adapts the overhead gain bysetting:

$\Delta_{G} = {\frac{I_{0}}{I_{0}^{({thr})}} \approx {\frac{ROT}{{ROT}_{thr}}.}}$

Δ_(G) may be controlled to not go under 0 dB since this would correspondto decrease the overhead subchannel power which is unlikely to behelpful.

The gain and power control scheme may include an inner and outer loop PC2304, 2300 for E_(cp), as in FIG. 23, a GC loop 2600 for Δ_(G) asdescribed above, an open-loop GC 2306 for Δ_(T2P), where Δ_(T2P) isincreased whenever the PER is above a target value, and is decreasedwhen the PER is below the target. A maximum level of Δ_(T2P) is allowed,corresponding to the level of the no-IC receiver.

DRC-Only Overhead Gain Control

FIG. 27 illustrates a variation of FIG. 26 with DRC-only overhead gaincontrol 2702.

Even when the overhead subchannel gain is adapted, the gain control ofΔhd T2P 2700 can be performed with a closed loop, as described above. Inthis case, the E_(cp) and Δ_(T2P) are controlled as in the scheme ofFIG. 23, while the adaptation of the overhead subchannel gain 2702 isperformed through the DRC erasure rate. In particular, if the DRCerasure is above a threshold, the overhead subchannel gain 2702 isincreased. When the DRC erasure rate is below a threshold, the overheadgain 2702 is gradually decreased.

Control of T2P in a Multi-Sector Multi-Cell Network

Since the GC of Δ_(T2P) is performed on a cell level, and an AT 106 maybe in softer hand-off, the various sectors may generate differentrequests of adaptation. In this case various options may be consideredfor the choice of the Δ_(T2P) request to be sent to the AT. At a celllevel, a method may choose the minimum reduction of T2P, among thoserequested by fully loaded sectors, i.e.,

$\Delta_{T2P}^{({cell})} = {\max\limits_{s \in {\{{{loaded}\mspace{14mu}{sectors}}\}}}\left\{ \Delta_{T\; 2P}^{(s)} \right\}}$where Δ_(T2P) ^((s)) is the Δ_(T2P) required by the sector s. The AT mayreceive different requests from various cells, and also in this case,various criteria can be adopted. A method may choose the Δ_(T2P)corresponding to the serving sector in order to ensure the most reliablecommunication with it.

For the choice of Δ_(T2P) both at a cell and at the AT, other choicesmay be considered, including the minimum, maximum or mean among therequested values.

One important aspect is for the mobiles to use T2P′=T2P×Δ_(T2P), whereΔ_(T2P) is calculated at the BTS based on measurements of Io and Io′(and possibly also knowledge of I_(o) ^(thr)), and G′=G×Δ_(G), whereΔ_(G) is also calculated at the BTS. With these delta_factors calculatedat the BTS, they are broadcast by each BTS to all the access terminals,who react accordingly.

The concepts disclosed herein may be applied to a WCDMA system, whichuses overhead channels such as a dedicated physical control channel(DPCCH), an enhanced dedicated physical control channel (E-DPCCH), or ahigh-speed dedicated physical control channel (HS-DPCCH). The WCDMAsystem may use a dedicated physical data channel (DPDCH) format and/oran enhanced dedicated physical data channel (E-DPDCH) format.

The disclosed herein may be applied to WCDMA systems with two differentinterlace structures, e.g., a 2-ms transmit time interval and 10-mstransmit time interval, thus, a front-end memory, demodulator, andsubtractor may be configured to span one or more subpackets of packetsthat have different transmit time intervals.

For TIC, the traffic data may be sent by one or more users in at leastone of an EV-DO Release 0 format or an EV-DO Revision A format.

Specific decoding orders described herein may correspond to an order fordemodulating and decoding. Re-decoding a packet should be fromre-demodulation because the process of demodulating a packet from theFERAM 312 translates the interference cancellation into a better decoderinput.

Those of skill in the art would understand that information and signalsmay be represented using any of a variety of different technologies andtechniques. For example, data, instructions, commands, information,signals, bits, symbols, and chips that may be referenced throughout theabove description may be represented by voltages, currents,electromagnetic waves, magnetic fields or particles, optical fields orparticles, or any combination thereof.

Those of skill in the art would further appreciate that the variousillustrative logical blocks, modules, circuits, and algorithm stepsdescribed in connection with the embodiments disclosed herein may beimplemented as electronic hardware, computer software, or combinationsof both. To clearly illustrate this interchangeability of hardware andsoftware, various illustrative components, blocks, modules, circuits,and steps have been described above generally in terms of theirfunctionality. Whether such functionality is implemented as hardware orsoftware depends upon the particular application and design constraintsimposed on the overall system. Skilled artisans may implement thedescribed functionality in varying ways for each particular application,but such implementation decisions should not be interpreted as causing adeparture from the scope of the present invention.

The various illustrative logical blocks, modules, and circuits describedin connection with the embodiments disclosed herein may be implementedor performed with a general purpose processor, a digital signalprocessor (DSP), an application specific integrated circuit (ASIC), afield programmable gate array (FPGA) or other programmable logic device,discrete gate or transistor logic, discrete hardware components, or anycombination thereof designed to perform the functions described herein.A general purpose processor may be a microprocessor, but in thealternative, the processor may be any conventional processor,controller, microcontroller, or state machine. A processor may also beimplemented as a combination of computing devices, e.g., a combinationof a DSP and a microprocessor, a plurality of microprocessors, one ormore microprocessors in conjunction with a DSP core, or any other suchconfiguration.

The steps of a method or algorithm described in connection with theembodiments disclosed herein may be embodied directly in hardware, in asoftware module executed by a processor, or in a combination of the two.A software module may reside in RAM memory, flash memory, ROM memory,EPROM memory, EEPROM memory, registers, hard disk, a removable disk, aCD-ROM, or any other form of storage medium. A storage medium is coupledto the processor such that the processor may read information from, andwrite information to, the storage medium. In the alternative, thestorage medium may be integral to the processor. The processor and thestorage medium may reside in an ASIC. The ASIC may reside in a userterminal. In the alternative, the processor and the storage medium mayreside as discrete components in a user terminal.

Headings are included herein for reference and to aid in locatingcertain sections. These headings are not intended to limit the scope ofthe concepts described therein under, and these concepts may haveapplicability in other sections throughout the entire specification.

The previous description of the disclosed embodiments is provided toenable any person skilled in the art to make or use the presentinvention. Various modifications to these embodiments will be readilyapparent to those skilled in the art, and the generic principles definedherein may be applied to other embodiments without departing from thespirit or scope of the invention. Thus, the present invention is notintended to be limited to the embodiments shown herein but is to beaccorded the widest scope consistent with the principles and novelfeatures disclosed herein.

What is claimed is:
 1. A method to reduce interference, the method comprising: storing samples of data frames transmitted asynchronously from a plurality of access terminals; decoding a first frame of data from the stored samples, the first frame of data sent from a first group of one or more access terminals; if the first frame of data is correctly decoded, subtracting the decoded first frame from the stored samples; decoding a second frame of data from the stored samples, the second frame of data sent from a second group of one or more access terminals; if the second frame of data is correctly decoded, subtracting the decoded second frame from the stored samples; and decoding a frame that failed to previously decode.
 2. The method of claim 1, further comprising demodulating the first and second frames.
 3. The method of claim 1, further comprising selecting one or more access terminals having a communication characteristic different than other access terminals as the first group.
 4. A method to reduce interference, the method comprising: storing time-interlaced subpackets received from a plurality of access terminals, each subpacket corresponding to an encoded data packet; decoding a first data packet using one or more stored, time-interlaced subpackets; if decoding the first packet is successful, reconstructing one or more subpackets corresponding to the first packet; subtracting the reconstructed subpackets from the stored time-interlaced subpackets; and decoding a second packet using one or more stored, time-interlaced subpackets.
 5. The method of claim 4, wherein reconstructing one or more subpackets comprises: encoding the first packet; and modulating the encoded first packet.
 6. The method of claim 4, further comprising: demodulating one or more subpackets corresponding to the first packet with a first code sequence corresponding to a first access terminal; and demodulating one or more subpackets corresponding to the second packet with a second code sequence corresponding to a second access terminal.
 7. The method of claim 4, further comprising simultaneously decoding a plurality of packets sent from a plurality of access terminals.
 8. The method of claim 4, further comprising sequentially demodulating and decoding a plurality of packets sent from a plurality of access terminals.
 9. The method of claim 4, further comprising selecting an access terminal having a higher traffic transmit power than other access terminals as a first access terminal to demodulate and to decode a packet.
 10. The method of claim 4, further comprising selecting an access terminal having a larger payload than other access terminals as a first access terminal to demodulate and to decode a packet.
 11. The method of claim 4, further comprising selecting an access terminal having a higher signal-to-interference-and-noise-ratio (SINR) than other access terminals as a first access terminal to demodulate and to decode a packet.
 12. The method of claim 4, further comprising selecting an access terminal having an older undecoded packet compared to packets of other access terminals as a first access terminal to demodulate and to decode a packet.
 13. The method of claim 4, further comprising, after subtracting the reconstructed subpackets from the stored time-interlaced subpackets, demodulating and decoding a third packet using one or more subpackets from the stored time-interlaced subpackets, the third packet being previously unsuccessful in decoding.
 14. The method of claim 4, further comprising iteratively demodulating and decoding previously unsuccessfully decoded packets.
 15. The method of claim 4, further comprising: decoding all subpackets sent from a set of access terminals that terminate in a current time slot; reconstructing all successfully decoded subpackets that terminate in the current time slot; subtracting the reconstructed subpackets from the stored subpackets; and demodulating and decoding a subpacket that failed decoding in a previous time slot.
 16. The method of claim 4, further comprising: decoding all subpackets sent from a set of access terminals that terminate in a current time slot; reconstructing all successfully decoded subpackets that terminate in the current time slot; subtracting the reconstructed subpackets from the stored subpackets; and demodulating and decoding a third data packet before all subpackets corresponding to that third data packet have been stored.
 17. The method of claim 4, further comprising providing Hybrid Automatic Repeat Request (H-ARQ) to the access terminals.
 18. The method of claim 4, further comprising receiving subpackets which were transmitted asynchronously from a plurality of access terminals.
 19. A base station comprising: a front-end memory configured to store samples of time-interlaced signals received from a plurality of access terminals; a demodulator configured to demodulate the stored samples using a first code sequence corresponding to a first access terminal; a decoder configured to decode data from the demodulated samples; a reconstruction unit configured to use decoded data to reconstruct encoded and modulated samples; and a subtractor configured to subtract reconstructed samples from the samples stored in the front-end memory to reduce interference for the decoder to subsequently decode data from the stored samples.
 20. The base station of claim 19, further comprising an error detection unit to detect if the decoder correctly decoded data from the demodulated samples.
 21. The base station of claim 19, further comprising a back-end memory configured to store demodulated symbols of data demodulated from samples stored in the frond-end memory.
 22. The base station of claim 21, wherein the back-end memory stores demodulated symbols of subpackets that are no longer stored in the front-end memory when the front-end memory does not span all subpackets.
 23. The base station of claim 19, wherein the front-end memory is configured to store a plurality of slots of samples of signals received from a plurality of access terminals operating with Hybrid Automatic Repeat Request (H-ARQ).
 24. The base station of claim 19, wherein the demodulator is configured to demodulate and the decoder is configured to iteratively decode unsuccessfully decoded packets.
 25. The base station of claim 19, wherein the front-end memory has a length that spans a time period from a beginning of a first subpacket of a packet to an end of a last subpacket of the packet.
 26. The base station of claim 25, wherein the front-end memory has a length of about 40 slots.
 27. The base station of claim 19, wherein the front-end memory has a length that span less than a full packet.
 28. The base station of claim 19, wherein the front-end memory has a length that spans a time period from a beginning of a subpacket of a packet to an end of a subsequent subpacket of the packet.
 29. The base station of claim 19, wherein the base station is configured to receive and process CDMA2000 signals from the access terminals.
 30. The base station of claim 19, wherein the base station is configured to receive and process CDMA Evolution Data Optimized (EV-DO) Revision A signals from the access terminals.
 31. The base station of claim 19, wherein the base station is configured to receive and process Wideband CDMA (WCDMA) signals from the access terminals.
 32. The base station of claim 19, wherein the front-end memory, demodulator, and subtractor are configured to span one or more subpackets of packets that have different transmit time intervals.
 33. The base station of claim 19, wherein the front-end memory, demodulator, and subtractor are configured to span more subpackets of 2 milliseconds transmit time interval packets than subpackets of 10 milliseconds transmit time interval packets.
 34. The base station of claim 19, wherein the base station is configured to receive and process CDMA EV-DV signals from the access terminals.
 35. An apparatus for reducing interference, comprising: means for storing samples of data frames transmitted asynchronously from a plurality of access terminals; means for decoding a first frame of data from the stored samples, the first frame of data sent from a first group of one or more access terminals; if the first frame of data is correctly decode, means for subtracting the decoded first frame from the stored samples; means for decoding a second frame of data from the stored samples, the second frame of data sent from a second group of one ore more access terminals; if the second frame of data is correctly decoded, means for subtracting the decoded second frame from the stored samples; and means for decoding a frame that failed to previously decode.
 36. The apparatus of claim 35, further comprising means for demodulating the first and second frames.
 37. The apparatus of claim 35, further comprising means for selecting one or more access terminals having a communication characteristic different than other access terminals as the first group.
 38. An apparatus for reducing interference, comrpising: means for storing time-interlaced subpackets received from a pluarlity of access terminals, each subpacket corresponding to an encoded data packet; means for decoding a first data packet using one or more stored, time-interlaced subpackets; if decoding the first packet is successful, means for reconstructing one or more subpackets corresponding to the first packet; means for subtracting the reconstructed subpackets from the stored time-interlaced subpackets; and means for decoding a second packet using one or more stored, time-interlaced subpackets.
 39. The apparatus of Claim 38, wherein said means for reconstructing one or more subpackets further comprises: means for encoding the first packet; and means for modulating the encoded first packet.
 40. The apparatus of Claim 38, further comprising: means for demodulating one or more subpackets corresponding to the first packet with a first code sequence corresponding to a first access terminal; and means for demodulating one or more subpackets corresponding to the second packet with a second code sequence corresponding to a second access terminal.
 41. The apparatus of claim 38, further comprising means for simultaneously decoding a plurality of packets sent from a plurality of access terminals
 42. The apparatus of claim 38, further comprising means for sequentially demodulating and decoding a pluriality of packets sent from a pluarlity of access terminals.
 43. The apparatus of claim 38, further comprising means for selecting access terminal having a higher traffic transmit power than other access terminals as a first access terminal to demodulate and to decode a packet.
 44. The appartus of claim 38, further comprising means for selecting an access terminal having a larger payload than other access terminals as a first access termional to demodulate and to decode a packet.
 45. The apparatus of claim 38, further comprising means for selecting an access terminal having a higher signal-to-interference-and-noise-ratio (SINR) than other access terminals as a first access terminal to demodulate and to decode a packet.
 46. The apparatus of claim 38, further comprising means for selcting an access terminal having an older undecoded packet compared to packets of other access terminals as a first access terminal to demodulate and to decode a packet.
 47. The apparatus of claim 38, further comprising, means for demodulating and means for decoding a third packet using one or more subpackets from the stored time-interlaced subpackets, the third packet being previously unsuccessful in decoding.
 48. The apparatus of claim 38, further comprising means for iteratively demodulating and means for decoding previously unsuccessfully decoded packets.
 49. The apparatus of claim 38, further comprising: means for decoding all subpackets sent from a set of access terminals that terminate in a current time slot; means for reconstructing all successfully decoded subpackets that terminate in the current time slot; means for subtracting the reconstructed subpackets from the stored subpackets; and means for demodulating and decode a subpacket that failed decoding in a previous time slot.
 50. The apparatus of claim 38, further comprising: means for decoding all subpackets sent from a set of access terminals that terminate in a current time slot; means for reconstructing all successfully decoded subpackets that terminate in the current time slot; means for subtracting the reconstructed subpackets from the stored subpackets; and means for demodulating and decode a third data packet before all subpackets corresponding to that third data packet have been stored.
 51. The apparatus of Claim 38, further comprising means for providing Hybrid Automatic Repeat Request (H-ARQ) to the access terminals.
 52. The apparatus of Claim 38, further comprising means for receiving subpackets which were transmitted asynchronously from a plurality of access terminals.
 53. A computer program product, comprising: nontranisory computer-readable medium comprising: code for causing a computer to store samples of data frames transmitted asynchronously from a plurality of access terminals; code for causing the computer to decode a first frame of data from the stored samples, the first frame of data sent from a first group of one or more access terminals; if the first frame of data is correctly decoded, code for causing the computer to subtract the decoded first frame from the stored samples; code for causing the computer to decode a second frame of data from the stored samples, the second frame of data sent from a second group of one or more access terminals; if the second frame of data is correctly decoded, code for causing the computer to subtract the decoded second frame from the stored samples; and code for causing the computer to decode a frame that failed to previously decode.
 54. The computer program product of Claim 53, wherein the computer-readable medium further comprises code for causing a computer to demodulate the first and second frames.
 55. The computer program product of Claim 53, wherein the computer-readable medium further comprises code for causing a computer to select one or more access terminals having a communication characteristic different than other access terminals as the first group.
 56. A computer program product, comprising: nontranisory computer-readable medium comprising: code for causing a computer to store time-interlaced subpackets received from a plurality of access terminals, each subpacket corresponding to an encoded data packet; code for causing the computer to decode a first data packet using one or more stored, time-interlaced subpackets; if decoding the first packet is successful, code for causing the computer to reconstruct one or more subpackets corresponding to the first packet; code for causing the computer to subtract the reconstructed subpackets from the stored time-interlaced subpackets; and code for causing the computer to decode a second packet using one or more stored, time-interlaced subpackets. 